Provably Correct Architecture Refinement

نویسندگان

  • Samar Abdi
  • Daniel Gajski
چکیده

This paper presents a formal approach to correctly generate an architecture level model of a system from its specification model. We define the notion of equivalence of models based on their execution semantics. A formalism is then presented, which can be used to model systems and perform correct transformations on them. Architecture refinement is described, as a sequence of such transformations on the specification model, that results in an equivalent architecture model. This method of deriving one model from another through well defined rules can alleviate the problem of validating every model at different abstraction levels in system design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stepwise Refinement of Data Flow Architectures

Software and hardware architectures are prone to modi cations We demon strate how a mathematically founded re nement calculus for a class of ar chitectures namely data ow networks can be used to modify a system in a provably correct way The calculus consists of basic rules to add and to remove components and channels to a system

متن کامل

Designing a Provably Correct Robot Control System Using a 'Lean' Formal Method

A development method for the construction of provably correct robot control systems together with its supporting tool environment are described. The method consists of four stages: 1. specification, 2. refinement, 3. simulation and 4. code. The method is centered around the notion of wide-spectrum formalism within which an abstract Interval Temporal Logic (ITL) representation is intermixed free...

متن کامل

A Constrained Interface Refinement Method for Embedded System Design

This report presents a constrained interface approach to embedded system design. It traces the development of the Timed Transition Model (TTM) and proposes a higher level of abstraction, based on that model, that we call a Timed Transition Interface Model (TTIM). This model is the thread linking a method of hierarchical refinement, referred to here as Higher Order Embedded System Design (HOESD)...

متن کامل

A Provably Correct Functional Programming Approach to the Prototyping of Formal Z Specifications

This paper describes a systematic way of constructing correct prototypes in a functional language such as Miranda or Haskell from Z specifications. A formal relationship between Z specifications and functional prototypes is established. This relationship is based on model refinement in the sense of specification refinement in the model-oriented specification style. To reduce the number of proof...

متن کامل

A Seamless Eiffel-Based Refinement Calculus for Object-Oriented Systems

The Eiffel language [4] can be used throughout the object-oriented software development process, for both specification and implementation. We outline work-in-progress on developing a refinement calculus for producing provably correct Eiffel programs from Eiffel specifications. We propose extensions to the calculus by integrating abstract data types as a front-end language that can be used for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003